Tandem behavior of an M/M/1/N → G/M/1 queuing system

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extension of heuristics for simulating population overflow in Jackson tandem queuing networks to non-Markovian tandem queuing networks

In this paper we extend previously proposed state-dependent importance sampling heuristics for simulation of population overflow in Markovian tandem queuing networks to nonMarkovian tandem networks, and experimentally demonstrate the asymptotic efficiency of the resulting heuristics.

متن کامل

Priority queuing in an operating system

The analysis of a preemptive priority queuing system with K ( ≥ 2 ) classes of jobs is undertaken. The system consists of a single processor representing a model of discrete dynamic scheduling problems associated with M k / Gk / 1 / ∞ endogenous priority queues. The processor schedules jobs which arrive according to a Markov arrival process. The process of service is arbitrary. With each job ar...

متن کامل

Optimal Control of a Two-stage Tandem Queuing System with Flexible Servers

We consider the optimal control of two parallel servers in a two-stage tandem queuing system with two flexible servers+ New jobs arrive at station 1, after which a series of two operations must be performed before they leave the system+ Holding costs are incurred at rate h1 per unit time for each job at station 1 and at rate h2 per unit time for each job at station 2+ The system is considered u...

متن کامل

Performance Analysis of Two Priority Queuing Systems in Tandem

In this paper, we consider a tandem of two head-of-line (HOL) non-preemptive priority queuing systems, each with a single server and a deterministic service-time. Two classes of traffic are considered, namely high priority and low priority traffic. By means of a generating function approach, we present a technique to derive closed-form expressions for the mean buffer occupancy at each node and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1988

ISSN: 0898-1221

DOI: 10.1016/0898-1221(88)90181-2